On Multisequences and their extensions

نویسندگان

  • Srinivasan Krishnaswamy
  • Harish K. Pillai
چکیده

In this paper we deal with the dimension of multisequences and related properties. For a given multisequenceW and R ∈ Z+, we define the R−extension ofW . Further we count the number of multisequences W whose R−extensions have maximum dimension and give an algorithm to derive such multisequences. We then go on to use this theory to count the number of Linear Feedback Shift Register(LFSR) configurations with multi input multi output delay blocks for any given primitive characteristic polynomial and also to design such LFSRs. Further, we use the result on multisequences to count the number of Hankel matrices of any given dimension.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multisequences with high joint nonlinear complexity

We introduce the new concept of joint nonlinear complexity for multisequences over finite fields and we analyze the joint nonlinear complexity of two families of explicit inversive multisequences. We also establish a probabilistic result on the behavior of the joint nonlinear complexity of random multisequences over a fixed finite field.

متن کامل

Error linear complexity measures for multisequences

Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the complexity of multisequences. We introduce various options for error linear complexity measures for multisequences....

متن کامل

Generalized Joint Linear Complexity of Linear Recurring Multisequences

The joint linear complexity of multisequences is an important security measure for vectorized stream cipher systems. Extensive research has been carried out on the joint linear complexity of N-periodic multisequences using tools from Discrete Fourier transform. Each Nperiodic multisequence can be identified with a single N-periodic sequence over an appropriate extension field. It has been demon...

متن کامل

On the joint linear complexity profile of explicit inversive multisequences

Weprove lower bounds on the joint linear complexity profile of multisequences obtained by explicit inversive methods and show that for some suitable choices of parameters these joint linear complexity profiles are close to be perfect. © 2004 Elsevier Inc. All rights reserved.

متن کامل

The expected value of the joint linear complexity of periodic multisequences

Complexity measures for sequences of elements of a finite field, such as the linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based (or vectorized) stream ciphers, which require the study of the complexity of multisequences. We extend a wellknown relationship between the linear complexity of an N -periodic sequence ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1208.4501  شماره 

صفحات  -

تاریخ انتشار 2012